Unmixed bipartite graphs and sublattices of the Boolean lattices

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unmixed Bipartite Graphs and Sublattices of the Boolean Lattices

The correspondence between unmixed bipartite graphs and sublattices of the Boolean lattice is discussed. By using this correspondence, we show the existence of squarefree quadratic initial ideals of toric ideals arising from minimal vertex covers of unmixed bipartite graphs.

متن کامل

Resolution of Unmixed Bipartite Graphs

For an unmixed bipartite graph G we consider the lattice of vertex covers LG and compute depth, projective dimension and extremal Bettinumbers of R/I(G) in terms of this lattice.

متن کامل

Maximal independent sets in bipartite graphs obtained from Boolean lattices

Attempts to enumeratemaximal antichains in Boolean lattices give rise to problems involving maximal independent sets in bipartite graphs whose vertex sets are comprised of adjacent levels of the lattice and whose edges correspond to proper containment. In this paper, we find bounds on the numbers of maximal independent sets in these graphs. © 2010 Elsevier Ltd. All rights reserved.

متن کامل

Distributive Lattices, Bipartite Graphs and Alexander Duality

A certain squarefree monomial ideal HP arising from a finite partially ordered set P will be studied from viewpoints of both commutative algbera and combinatorics. First, it is proved that the defining ideal of the Rees algebra of HP possesses a quadratic Gröbner basis. Thus in particular all powers of HP have linear resolutions. Second, the minimal free graded resolution of HP will be construc...

متن کامل

Maximal Sublattices and Frattini Sublattices of Bounded Lattices

We will address these questions in order, and provide good partial answers, especially for nite lattices which are bounded homomorphic images of a free lattice. Recall that a nite lattice is bounded if and only if it can be obtained from the one element lattice by a sequence of applications of Alan Day's doubling construction for intervals. In particular, nite distributive lattices are bounded....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebraic Combinatorics

سال: 2009

ISSN: 0925-9899,1572-9192

DOI: 10.1007/s10801-009-0168-1